package BitSet;
import java.util.ArrayList;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;

import instrumentation.CoverageBranchTarget;
import instrumentation.TrackerCoverage;
import junit.framework.*;
import junit.textui.*;

public class RandoopTest extends TestCase {
	public static TrackerCoverage track=  TrackerCoverage.getTracker();
  public static void main(String[] args) {
    TestRunner runner = new TestRunner();
    TestResult result = runner.doRun(suite(), false);
    if (! result.wasSuccessful()) {
      System.exit(1);
    }
//    System.out.print(track.toString());
//    Map<Integer,CoverageBranchTarget> trackers =track.getTrackers(); //new LinkedHashMap<Integer,CoverageBranchTarget>();
//	List<Integer> keys = new ArrayList<Integer>( trackers.keySet());  
//
//	int CoveredBR=0;
//	int unCoveredBR=0;
//	for( int i=0; i<keys.size();i++){			
//		CoverageBranchTarget condTarget=(CoverageBranchTarget)trackers.get(keys.get(i));
//		if(condTarget.getQuality()==Float.NEGATIVE_INFINITY)
//			CoveredBR++;
//		else
//			unCoveredBR++;
//	}
//	 System.out.println("Total Branches  ( " + keys.size()  +" ): ");
//	 System.out.println("BR COVERAGE SUMMARY ( " + CoveredBR  +" ): ");
//	 System.out.println("BR COVERAGE SUMMARY ( " + unCoveredBR  +" ): ");
  }

  public RandoopTest(String name) {
    super(name);
  }

  public static Test suite() {
	  
    TestSuite result = new TestSuite();
    result.addTest(new TestSuite(RandoopTest0.class));
   result.addTest(new TestSuite(RandoopTest1.class));

    return result;
  }

}
